منابع مشابه
Implicational F-Structures and Implicational Relevance Logics
We describe a method for obtaining classical logic from intuitionistic logic which does not depend on any proof system, and show that by applying it to the most important implicational relevance logics we get relevance logics with nice semantical and proof-theoretical properties. Semantically all these logics are sound and strongly complete relative to classes of structures in which all element...
متن کاملAverage Size of Implicational Bases
Implicational bases are objects of interest in formal concept analysis and its applications. Unfortunately, even the smallest base, the Duquenne-Guigues base, has an exponential size in the worst case. In this paper, we use results on the average number of minimal transversals in random hypergraphs to show that the base of proper premises is, on average, of quasi-polynomial size.
متن کاملCanonical Inference for Implicational Systems
Completion is a general paradigm for applying inferences to generate a canonical presentation of a logical theory, or to semi-decide the validity of theorems, or to answer queries. We investigate what canonicity means for implicational systems that are axiomatizations of Moore families – or, equivalently, of propositional Horn theories. We build a correspondence between implicational systems an...
متن کاملImplicational Rewriting Tactics in HOL
Reducing the distance between informal and formal proofs in interactive theorem proving is a long-standing matter. An approach to this general topic is to increase automation in theorem provers: indeed, automation turns many small formal steps into one big step. In spite of the usual automation methods, there are still many situations where the user has to provide some information manually, whe...
متن کاملResultative Markedness and Implicational Hierarchies
This is because the former are lexically implicated or entailed, and thus are more available and less expensive than the latter in the sense that they involve less practical reasoning. In addition, in terms of the strong-weak distinction, an implicational universal can be posited, namely that if a language has strong resultatives, it must have weak resultatives as well (Washio 1999, 2002). Seco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1975
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093891707